A Mechanized Bisimulation for the Nu-Calculus
نویسندگان
چکیده
We introduce a Sumii-Pierce-Koutavas-Wand-style bisimulation for Pitts and Stark’s nucalculus, a simply-typed lambda calculus with fresh name generation. This bisimulation coincides with contextual equivalence and provides a usable and elementary method for establishing all the subtle equivalences given by Stark [29]. We also describe the formalization of soundness and of the examples in the Coq proof assistant.
منابع مشابه
Bisimulation for BL-general fuzzy automata
In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...
متن کاملA mechanized verification environment for real-time process algebras and low-level programming languages
Nowadays, embedded and reactive real-time systems are often also distributed and operate in dynamically changing environments. Furthermore, these systems handle safety-critical tasks and therefore have to satisfy critical functional and non-functional requirements like, for example, real-time requirements. During development, such systems are often modeled on different levels of abstraction usi...
متن کاملOn Bisimulations for the Asynchronous - calculus ?
The asynchronous-calculus is a variant of the-calculus where message emission is non-blocking. Honda and Tokoro have studied a semantics for this calculus based on bisimulation. Their bisimulation relies on a modiied transition system where, at any moment, a process can perform any input action. In this paper we propose a new notion of bisimulation for the asynchronous-calculus, deened on top o...
متن کاملA Formulation of Open Bisimulation for the Spi Calculus: An extended abstract
A notion of open bisimulation is formulated for the spi calculus, an extension of the π-calculus with cryptographic primitives. This notion of open bisimulation is based on the so-called hedged bisimulation, due to Borgström and Nestmann. Open bisimulation is shown to be sound with respect to hedged bisimulation, and futher, open bisimilarity is shown to be a congruence relation on finite spi p...
متن کاملBisimulation Congruences for Homer a calculus of Higher-order mobile embedded resources
We extend Howe’s method for proving that late labelled transition bisimulations are congruences to a core process passing calculus with local names, extended with non-linear active process mobility and nested locations, as found in the Seal calculus, M-calculus, and Kell-calculus. The calculus we consider, called Homer for Higher-order Mobile Embedded Resources, has a very simple syntax and sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007